On Generalized Fuzzy Mean Code Word Lengths

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On generalized fuzzy mean code word lengths

In present communication, a generalized fuzzy mean code word length of degree β has been defined and its bounds in the term of generalized fuzzy information measure have been studied. Further we have defined the fuzzy mean code word length of type α, β and its bounds have also been studied. Monotonic behavior of these fuzzy mean code word lengths have been illustrated graphically by taking some...

متن کامل

Some New Results on Fuzzy Generalized ‘Useful’ Mean Lengths and Its Bounds

In this paper, we propose a fuzzy generalized ‘useful’ parametric mean length and bounds are obtained in terms of useful fuzzy measure. The bounds obtained are new and some known results are the particular cases of the proposed measure and bounds.

متن کامل

Some New Results on Fuzzy Generalized ‘Useful’ Mean Lengths and Its Bounds

In this paper, we propose a fuzzy generalized ‘useful’ parametric mean length and bounds are obtained in terms of useful fuzzy measure. The bounds obtained are new and some known results are the particular cases of the proposed measure and bounds.

متن کامل

Generalized Fuzzy Linguistic Weighted Bonferroni Mean Operator

In this paper, we investigate the multiple attribute decision making (MADM) problems with fuzzy linguistic information. Motivated by the ideal of generalized Bonferroni mean, we develop the generalized fuzzy linguistic Bonferroni Mean (GFLBM) operator for aggregating the fuzzy linguistic information. For the situations where the input arguments have different importance, we then define the gene...

متن کامل

On the set of uniquely decodable codes with a given sequence of code word lengths

For every natural number n ≥ 2 and every finite sequence L of natural numbers, we consider the set UDn(L) of all uniquely decodable codes over an n-letter alphabet with the sequence L as the sequence of code word lengths, as well as its subsets PRn(L) and FDn(L) consisting of, respectively, the prefix codes and the codes with finite delay. We derive the estimation for the quotient |UDn(L)|/|PRn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Applied Mathematics

سال: 2014

ISSN: 2330-0043

DOI: 10.11648/j.ajam.20140204.13